Adaptive distance measures for sequential data
نویسندگان
چکیده
Recent extensions of learning vector quantization (LVQ) to general (dis-)similarity data have paved the way towards LVQ classifiers for possibly discrete, structured objects such as sequences addressed by classical alignment. In this contribution, we propose a metric learning scheme based on this framework which allows for autonomous learning of the underlying scoring matrix according to a given discriminative task. Besides facilitating the often crucial and problematic choice of the scoring matrix in applications, this extension offers an increased interpretability of the results by pointing out structural invariances for the given task.
منابع مشابه
Asymptotic properties of the sample mean in adaptive sequential sampling with multiple selection criteria
We extend the method of adaptive two-stage sequential sampling toinclude designs where there is more than one criteria is used indeciding on the allocation of additional sampling effort. Thesecriteria, or conditions, can be a measure of the targetpopulation, or a measure of some related population. We developMurthy estimator for the design that is unbiased estimators fort...
متن کاملEfficient Algorithms for Similarity Measures over Sequential Data: A Look Beyond Kernels
Kernel functions as similarity measures for sequential data have been extensively studied in previous research. This contribution addresses the efficient computation of distance functions and similarity coefficients for sequential data. Two proposed algorithms utilize different data structures for efficient computation and yield a runtime linear in the sequence length. Experiments on network da...
متن کاملS2MP: Similarity Measure for Sequential Patterns
In data mining, computing the similarity of objects is an essential task, for example to identify regularities or to build homogeneous clusters of objects. In the case of sequential data seen in various fields of application (e.g. series of customers purchases, Internet navigation) this problem (i.e. comparing the similarity of sequences) is very important. There are already some similarity mea...
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملZone-3 Impadance Reach Setting of Distance Relays by Including In-feed Current Effects in an Adaptive Scheme
The undesired operation of zone 3 may be one of the most conspicuous protective relay features due to the incorrect zone 3 relay operations which have been conducive to the severity of blackouts. Therefore, determining the accurate zone 3 setting of the distance relay is deemed to be necessary. This paper focuses on the development of a new technique for calculating zone-3 setting of distance r...
متن کاملAn Empirical Comparison of Distance Measures for Multivariate Time Series Clustering
Multivariate time series (MTS) data are ubiquitous in science and daily life, and how to measure their similarity is a core part of MTS analyzing process. Many of the research efforts in this context have focused on proposing novel similarity measures for the underlying data. However, with the countless techniques to estimate similarity between MTS, this field suffers from a lack of comparative...
متن کامل